Algorithms for Variable-Weighted 2-SAT and Dual Problems
نویسندگان
چکیده
In this paper we study NP-hard variable-weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds holding for arbitrary real-valued weights. Moreover, we consider the monotone dual class consisting of clause sets where all variables occur at most twice. We show that weighted SAT, XSAT and NAESAT optimization problems for this class are polynomial time solvable using appropriate reductions to specific polynomial time solvable
منابع مشابه
Primal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملImproved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT
We present novel branch and bound algorithms for solving Max-SAT and weighted Max-SAT, and provide experimental evidence that outperform the algorithm of Borchers & Furman on Max-2-SAT and weighted Max-2-SAT instances. Our algorithms decrease the time needed to solve an instance, as well as the number of backtracks, up to two orders of magnitude.
متن کاملSolving Max-SAT as Weighted CSP
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We wanted to see how recent progress in the weighted CSP (WCSP) field could compete with other approaches in related fields. One of these fields is propositional logic and the well-known Max-SAT problem. In this paper, we...
متن کاملUsing Combinatorics to Prune Search Trees: Independent and Dominating Set
We introduce a surprisingly simple technique to design and analyze algorithms based on search trees, that significantly improves many existing results in the area of exact algorithms. The technique is based on measuring the progress of Branch & Bound algorithms by making use of a combinatorial relation between the average and maximum dual degrees of a graph. By dual degree of a vertex, we mean ...
متن کاملImproved Bounds for Exact Counting of Satisfiability Solutions
An algorithm is presented for exactly solving (in fact, counting) the number of maximum weight satisfying assignments of a 2-SAT formula. The worst case running time of O(1.2461) for formulas with n variables improves on the previous bound of O(1.2561) by Dahllöf, Jonsson, and Wahlström. The weighted 2-SAT counting algorithm can be applied to obtain faster algorithms for combinatorial counting ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007